1365B - Trouble Sort - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef long long ll;
typedef double D;
typedef long double LD;
typedef pair<ll, ll> pll;
#define re return 
#define fi first 
#define se second 
#define mp make_pair 
#define pb push_back 
#define rep(i,a, n) for (int i = a; i < (n); i++) 
#define fill(x, y) memset(x, y, sizeof(x)) 
#define sqr(x) ((x) * (x)) 
#define sqrt(x) sqrt(abs(x)) 

void solve(){
    int n;
    cin >> n;
    vector<int> a(n);
    bool sorted=1;
    for(int i=0;i<n;i++){
        cin >> a[i];
        if(i>0&&a[i]<a[i-1]) sorted=0;
    }
    bool zero=false;
    bool one=false;
    for(int i=0;i<n;i++){
        int x;
        cin >> x;
        if(x==0) zero=true;
        if(x==1) one=true;
    }
    if(zero&&one) cout << "yes" << endl;
    else if(sorted) cout << "yes" << endl;
    else cout << "no" << endl;
    
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}